Location:
Search - knapsack greedy
Search list
Description: 使用贪婪算法 解决0－1背包问题MATLAB源代码-greedy algorithm used to solve 0-1 knapsack problem MATLAB source code
Platform: |
Size: 799 |
Author: 林鑫 |
Hits:
Description: 使用贪婪算法 解决0－1背包问题MATLAB源代码-greedy algorithm used to solve 0-1 knapsack problem MATLAB source code
Platform: |
Size: 1024 |
Author: 林鑫 |
Hits:
Description: 该程序用贪心算法来求解0-1背包问题 采用贪婪准则：每次选择p/w最大的物品放入背包。-procedures with the greedy algorithm to solve 0-1 knapsack problem using greed criteria : Each choice p/w largest goods Add backpack.
Platform: |
Size: 2048 |
Author: 杨晨 |
Hits:
Description: 运用贪婪算法能够很好解决0/1背包问题，这是我编的一个小程序，运行过很好。-greedy algorithm can be used to solve a very good 0/1 knapsack problem, this is my part of a small program running very good.
Platform: |
Size: 1024 |
Author: 应吉平 |
Hits:
Description: 背包问题的贪婪算法，需要的下，不需要帐号的，自由的下。-knapsack problem of greedy algorithm, need, need not account, free under.
Platform: |
Size: 1024 |
Author: 王少石 |
Hits:
Description: 用多种算法解决0－1背包问题，包括回朔法，动态规划，贪心算法等-algorithm used to solve a variety of 0-1 knapsack problem, including the retrospective method, dynamic programming, greedy algorithm
Platform: |
Size: 431104 |
Author: 王垂宇 |
Hits:
Description: 背包问题非常有用的程序代码打包，包括贪心，回溯，动态规划-Knapsack problem is very useful package of program code, including greedy, backtracking, dynamic programming
Platform: |
Size: 6128640 |
Author: adsd |
Hits:
Description: 此程序是使用Java编写的，实现了可分割的0/1背包问题。程序主要是是使用了经典的贪心算法，能够很好的解决此问题。-This procedure is to use Java prepared to achieve that can be separated from 0/1 knapsack problem. Procedure is mainly the use of a classic greedy algorithm that can solve this problem.
Platform: |
Size: 4096 |
Author: gengxin |
Hits:
Description: 背包问题运用贪婪算法的matlab 程序实现-Use of greedy algorithm knapsack problem of matlab program
Platform: |
Size: 1024 |
Author: shangsheng |
Hits:
Description: 0／1背包问题的贪心优化解法 邓宏涛朱蜘
(江汉大学数学与计算机学院武汉430056)
摘要：介绍了0／1背包问题的基本贪心算法的解决策略，通过对贪心算法的改进和优化，找出0／1背包问题的最优解
的很好近似。-0/1 knapsack problem greedy optimization method of邓宏涛Zhu spider (Jianghan University, Mathematics and Computer Science, Wuhan 430056) Abstract: 0/1 knapsack problem of the greedy algorithm to solve the basic strategy of the greedy algorithm through the improvement and optimization, to find 0/1 knapsack problem of the optimal solution of a very good approximation.
Platform: |
Size: 175104 |
Author: qqq |
Hits:
Description: 背包问题是用贪心算法得到最优解得一个典型问题。背包问题具有最优子结构性质首先通过快速排序算法对物品按照单价从大到小排序，然后进行贪心选择。-Knapsack problem is a greedy algorithm with the optimal solution may be a typical problem. Knapsack problem with the nature of the optimal sub-structure, first of all, quick sort algorithm to sort items in accordance with the smallest unit, and then choose to greed.
Platform: |
Size: 1024 |
Author: workfuture |
Hits:
Description: 基于贪心算法的背包问题，大学软件基础实验。-Based on the greedy algorithm knapsack problem, the University of software-based experiments.
Platform: |
Size: 193536 |
Author: 马琳 |
Hits:
Description: Knapsack,用贪心算法解决背包问题，Visual C++ 6.0编译-Knapsack, with a greedy algorithm to solve knapsack problem, Visual C++ 6.0 compiler
Platform: |
Size: 2257920 |
Author: 草人 |
Hits:
Description: Knapsack Problem. Greedy algorythm.
Platform: |
Size: 107520 |
Author: anozer_sky |
Hits:
Description: Fractional knapsack problem, Greedy algorithm
Platform: |
Size: 408576 |
Author: Nguyen |
Hits:
Description: Greedy Alg Ofdm Example
Platform: |
Size: 1024 |
Author: Fray |
Hits:
Description: 将贪婪修复方法与遗传算法相结合，构成混和遗传算法，并求解经典背包问题。-The greedy repair method and genetic algorithm are combined to form hybrid genetic algorithm, and solve the classical knapsack problem.
Platform: |
Size: 23552 |
Author: 施金泉 |
Hits:
Description: 0—1背包问题的五种解法
1贪心法
2动态规划
3回溯
4分支限界
5遗传算法-0-1 knapsack problem greedy algorithm five Solution 1 2 3 back in 4 dynamic programming genetic algorithm branch and bound 5
Platform: |
Size: 252928 |
Author: tunzhao |
Hits:
Description: 详细的讲述了贪心算法和遗传算法相结合去求解NP难题，背包问题。-Greedy algorithm described in detail and the combination of genetic algorithms to solve the NP problem, knapsack problem.
Platform: |
Size: 3072 |
Author: liulei |
Hits:
Description: 使用贪心算法解决经典背包问题的C语言实现。-Using the greedy algorithm to solve the classic knapsack problem C language.
Platform: |
Size: 527360 |
Author: 靳舒馨 |
Hits: